Assembly maintainability Study with Motion Planning
نویسندگان
چکیده
Maintainability is an important issue in design where the accessibility of certain parts is determined for routine maintenance. In the past its study has been largely manual and labor intensive. Either by using physical mockup or computer animation with CAD models of a design, the task relies on human to provide an access path for the part. In this paper, we present an automated approach to replace this manual process. By applying results from and developing extensions to research in motion planning and other fields, we demonstrate that an automated maintainability study system is feasible. We describe general extensions needed to adapt robotic motion planning techniques in maintainability studies. We show results from applying such a system to two classes of industrial application problems.
منابع مشابه
SM01-144: A Voronoi-Based Framework for Motion Planning and Maintainability Applications
We present a new approach for motion planning and maintainability studies in complex 3D CAD environments. It automatically computes a collision-free path for moving objects among stationary and completely known obstacles. Our framework uses a combination of analytic, criticalitybased and probabilistic techniques to compute the path. It starts with an global strategy, which uses an approximate V...
متن کاملDesign for Maintenance by Constrained Motion Planning
In designing an assembly product, maintainability is a crucial issue that determines whether certain parts can be accessed for routine maintenance. In the past its study has been largely manual and labor intensive. Either by using physical mockup or computer animation with CAD models of a design, the task relies on human to provide an access path for the part. In this paper we present an automa...
متن کاملPath planning in expansive configuration spaces
We introduce the notion of expansiveness to characterize a family of robot conngu-ration spaces whose connectivity can be eeectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive connguration spaces has inspired us to develop a new randomized planning algorithm. This new algorithm tries to sample only the portion of the connguration space that is relevant to th...
متن کاملPath Planning in Expansive Con guration Spaces
We introduce the notion of expansiveness to characterize a family of robot connguration spaces whose connectivity can be eeectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive connguration spaces has inspired us to develop a new randomized planning algorithm. This new algorithm tries to sample only the portion of the connguration space that is relevant to the...
متن کاملPath Planning in Expansive Con guration SpacesDavid
We introduce the notion of expansiveness to characterize a family of robot connguration spaces whose connectivity can be eeectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive connguration spaces has inspired us to develop a new randomized planning algorithm. This algorithm tries to sample only the portion of the connguration space that is relevant to the cur...
متن کامل